Fissioned Triangular Schemes via the Cross-ratio
نویسندگان
چکیده
منابع مشابه
Improved Triangular Subdivision Schemes
In this article we improve the butterfly and Loop’s algorithm. As a result we obtain subdivision algorithms for triangular nets which can be used to generate G and G surfaces, respectively.
متن کاملDesigning composite triangular subdivision schemes
The paper iterates on the observation made independently by several groups of authors that building subdivision schemes out of simple, very local and geometrically invariant averaging rules is convenient both from a theoretical and practical point of view. We review the benefits of this approach with special emphasis on the smoothness analysis of the limit surfaces, derive certain guidelines fo...
متن کاملHigh Order Fluctuation Schemes on Triangular Meshes
We develop a new class of schemes for the numerical solution of first-order steady conservation laws. The schemes are of the residual distribution, or fluctuation-splitting type. These schemes have mostly been developed in the context of triangular or tetrahedral elements whose degrees of freedom are their nodal values. We work here with more general elements that allow high-order accuracy. We ...
متن کاملAdaptive Subdivision Schemes for Triangular Meshes
Of late we have seen an increase in the use of subdivision techniques for both modeling and animation. They have given rise to a new surface called the subdivision surface which has many advantages over traditional Non Uniform Rational B-spline (NURB) surfaces. Subdivision surfaces easily address the issues related to multiresolution, re nement, scalability and representation of meshes. Many sc...
متن کاملLimit Theorems for Random Triangular Urn Schemes
In this paper we study a generalized Pólya urn with balls of two colors and a random triangular replacement matrix. We extend some results of Janson (2004), (2005) to the case where the largest eigenvalue of the mean of the replacement matrix is not in the dominant class. Using some useful martingales and the embedding method introduced in Athreya and Karlin (1968), we describe the asymptotic c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Combinatorics
سال: 2001
ISSN: 0195-6698
DOI: 10.1006/eujc.2000.0467